E cient Organization of Large Multidimensional Arrays

cient Organization of Large Multidimensional Arrays

Large multidimensional arrays are widely used in scientiic and engineering database applications. In this paper, we present methods of organizing arrays to make their access on secondary and tertiary memory devices fast and eecient. We have developed four techniques for doing this: (1) storing the array in multidimensional \chunks" to minimize the number of blocks fetched, (2) reordering the ch...

Eecient Organization of Large Multidimensional Arrays

Large multidimensional arrays are widely used in sci-entiic and engineering database applications. In this paper, we present methods of organizing arrays to make their access on secondary and tertiary memory devices fast and eecient. We have developed four techniques for doing this: (1) storing the array in multidimensional \chunks" to minimize the number of blocks fetched, (2) reordering the c...

Efficient Organization of Large Multidimensional Arrays

Rare-event simulation for multidimensional random walks with t distributed increments

In this paper we consider a stylized multidimensional rare-event simulation problem for a heavy-tailed process. More precisely, the problem of e¢ cient estimation via simulation of …rst passage time probabilities for a multidimensional random walk with t distributed increments. This problem is a natural generalization of ruin probabilities in insurance, in which the focus is a one dimensional r...

cient Coding Schemes for the Hard Square Model

The hard square model consists of all binary arrays in which the s are isolated both hor izontally and vertically Based on a certain proba bility measure de ned on those arrays an e cient variable to xed rate encoder scheme is obtained that maps unconstrained binary words into arrays that sat isfy the hard square model For su ciently large ar rays the average rate of the encoder approaches a va...